1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
|
// deque::operator[] example: reversing order
#include <iostream>
#include <deque>
int main ()
{
std::deque<int> mydeque (10); // 10 zero-initialized elements
std::deque<int>::size_type sz = mydeque.size();
// assign some values:
for (unsigned i=0; i<sz; i++) mydeque[i]=i;
// reverse order of elements using operator[]:
for (unsigned i=0; i<sz/2; i++)
{
int temp;
temp = mydeque[sz-1-i];
mydeque[sz-1-i]=mydeque[i];
mydeque[i]=temp;
}
// print content:
std::cout << "mydeque contains:";
for (unsigned i=0; i<sz; i++)
std::cout << ' ' << mydeque[i];
std::cout << '\n';
return 0;
}
| |